On Tightness of the Skew Random Walks
نویسندگان
چکیده
Skew Brownian motion was introduced by Itô and Mckean 1 to furnish a construction of certain stochastic processes related to Feller’s classification of second-order differential operators associated with diffusion processes see also Section 4.2 in 2 . For α ∈ 0, 1 , the α-skew Brownian motion is defined as a one-dimensional Markov process with the same transition mechanism as of the usual Brownian motion, with the only exception that the excursions away from zero are assigned a positive sign with probability α and a negative sign with probability 1 − α. The signs form an i.i.d. sequence and are chosen independently of the past history of the process. If α 1/2, the process is the usual Brownian motion. Formally, the α-skew random walk on Z starting at 0 is defined as the birth-death Markov chain S α {S α k ; k ≥ 0}with S0 0 and one-step transition probabilities given by
منابع مشابه
A PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS
A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...
متن کاملTightness for a Family of Recursive Equations
In this paper, we study the tightness of solutions for a family of recursive equations. These equations arise naturally in the study of random walks on tree-like structures. Examples include the maximal displacement of branching random walk in one dimension, and the cover time of symmetric simple random walk on regular binary trees. Recursion equations associated with the distribution functions...
متن کاملTightness for a Family of Recursion Equations
In this paper, we study the tightness of solutions for a family of recursion equations. These equations arise naturally in the study of random walks on tree-like structures. Examples include the maximal displacement of branching random walk in one dimension, and the cover time of symmetric simple random walk on regular binary trees. Recursion equations associated with the distribution functions...
متن کاملProbability-possibility DEA model with Fuzzy random data in presence of skew-Normal distribution
Data envelopment analysis (DEA) is a mathematical method to evaluate the performance of decision-making units (DMU). In the performance evaluation of an organization based on the classical theory of DEA, input and output data are assumed to be deterministic, while in the real world, the observed values of the inputs and outputs data are mainly fuzzy and random. A normal distribution is a contin...
متن کاملRandom recursive trees and the elephant random walk.
One class of random walks with infinite memory, so-called elephant random walks, are simple models describing anomalous diffusion. We present a surprising connection between these models and bond percolation on random recursive trees. We use a coupling between the two models to translate results from elephant random walks to the percolation process. We calculate, besides other quantities, exact...
متن کامل